The Balanced Hypercube: A Cube-Based System for Fault-Tolerant Applications

نویسندگان

  • Jie Wu
  • Ke Huang
چکیده

In this paper, we present an interconnection structure, called the balanced hypercube, which is a variation of the standard hypercube with desirable properties of strong connectivity, regularity, and symmetry. The proposed structure is a special type of load balanced graph designed to tolerate processor failure. In balanced hypercubes, each processor has a backup (matching) processor that shares the same set of neighboring nodes. Therefore, tasks that run on a faulty processor can be reactivated in the backup processor to provide efficient system reconfiguration. Other properties of balanced hypercubes are examined. It is also shown that odd-dimensional balanced hypercubes have smaller diameters than that of standard hypercubes. As an application of balanced hypercubes, we show a fault-tolerant embedding of rings in balanced hypercubes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Voting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems

some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...

متن کامل

Voting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems

some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...

متن کامل

A Fault-tolerant Multicast Routing Algorithm Based on Cube Algebra for Hypercube Networks

In this study a multicast routing algorithm has been developed for faulty hypercube parallel processing system using cube algebra. Without any restriction to the number of the faulty nodes, the routing from the source node to the destination node is implemented minimally. The developed routing algorithm has been visually simulated via prepared data routing simulator program. It has been observe...

متن کامل

Fault-Tolerant Routing and Disjoint Paths in Dual-Cube: A New Interconnection Network

In this paper, we introduce a new interconnection network, the dual-cube, its topological properties, and the routing/broadcasting algorithms in the dual-cube. The advanced subjects such as fault-tolerant routing and constructing multiple disjoint paths in dual-cubes are also included in this paper. The binary hypercube, or r-cube, can connect 2r nodes. In contrast, a dual-cube with r links for...

متن کامل

ult-Tolerant Cube Graphs and Coding Theory

target graph as a subgraph. Note that this approach guarantees that any algorithm designed for the target graph will run with no slowdown in the presence of f or fewer edge faults in the fault-tolerant graph, regardless of their distribution. Minimizing the cost in this model amounts to constructing a fault-tolerant graph with minimum degree. (See [4] for constructions that address node faults....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Computers

دوره 46  شماره 

صفحات  -

تاریخ انتشار 1997